On Range Queries in Universal B-trees
نویسندگان
چکیده
The Universal B-tree is a data structure for multidimensional data indexing. In this paper we introduce a new algorithm of processing the range query in UB-trees. This algorithm performs very well, especially in high-dimensional indexes and thus significantly reduces influence of the ”curse of dimensionality”. We explain the algorithm using a geometric model giving the reader understandable insight into the problem. The geometric model is based on an interesting fact that there exists a relation between the Z-curve and generalized quad-trees. We also present promising experimental results of our range query implementation.
منابع مشابه
ON QUASI UNIVERSAL COVERS FOR GROUPS ACTING ON TREES WITH INVERSIONS
Abstract. In this paper we show that if G is a group acting on a tree X with inversions and if (T Y ) is a fundamental domain for the action of G on X, then there exist a group &tildeG and a tree &tildeX induced by (T Y ) such that &tildeG acts on &tildeX with inversions, G is isomorphic to &tilde G, and X is isomorphic to &tildeX. The pair (&tilde G &tildeX) is called the quasi universal cover...
متن کاملEfficient Support for Range Queries and Range Updates Using Contention Adapting Search Trees
We extend contention adapting trees (CA trees), a family of concurrent data structures for ordered sets, to support linearizable range queries, range updates, and operations that atomically operate on multiple keys such as bulk insertions and deletions. CA trees differ from related concurrent data structures by adapting themselves according to the contention level and the access patterns to sca...
متن کاملEfficient Range Minimum Queries using Binary Indexed Trees
We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using the Binary Indexed Trees so that we can answer different types of queries, e.g. the range minimum query, in O (log N ) time complexity per operation, outperforming in speed similar data structures like Segment/Range Trees or the Sparse Table Algorithm.
متن کاملN-Ary Queries by Tree Automata
N -ary queries in trees select sets of n-tuples of nodes. We propose and investigate representation formalisms for n-ary queries by tree automata, both for ranked and unranked trees. We show that existential run-based queries capture MSO in the n-ary case, as well as universal run-based queries. We then characterize queries by runs of unambiguous tree automata, and show how to decide whether an...
متن کاملLoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to Temporal Data
In this paper, we consider the problem of exploiting I/O parallelism for efficient access to transaction-time temporal databases. As temporal databases maintain historical versions of records in addition to current ones, we consider range queries in both time dimension and key dimension. Multiple disks can be used to read sets of disk blocks in parallel, thereby improving the performance of suc...
متن کامل